Defining Algebraic Categories in Mathematica
نویسنده
چکیده
The paper deals with defining abstract algebraic structures in symbolic computation systems. By adopting a parameterized and object oriented approach, the categories defined for the algebraic structures will be particularized in specific domains. This approach has a good deal of efficiency, conceptual and practical advantages. The paper introduces constructive and algorithmic definitions for the basic concepts and for a number of algebraic structures. We present a Mathematica package which models a part of this algebraic hierarchy, based on these principles. The package can be used for deriving various domains in a parameterized manner and performing symbolic computations over them. AMS Subject Classification: 68Q40
منابع مشابه
IMPLEMENTING DOMAINS AND CATEGORIES IN MATHEMATICA BY MEANS OF PARAMETERIZED TYPES Presented at 4 International Workshop SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING
Symbolic computation in algebraic categories provides computer implementations for modern algebra theories. The present paper reveals the utility of the parameterized categorical approach by deriving a multivariate polynomial category (over various coefficient domains), which is used by our Mathematica implementation of Buchberger’s algorithms for determining the Gröbner basis. These implementa...
متن کاملParameterized Type Definitions in Mathematica: Methods and Advantages
The theme of symbolic computation in algebraic categories has become of utmost importance in the last decade since it enables the automatic modeling of modern algebra theories. On this theoretical background, the present paper reveals the utility of the parameterized categorical approach by deriving a multivariate polynomial category (over various coefficient domains), which is used by our Math...
متن کاملGrammatica : An Implementation of Algebraic Graph Transformation on Mathematica ⋆
Grammatica is a prototype implementation of algebraic graph transformation based on relation algebra. It has been implemented using Mathematica on top of the Combinatorica package, and runs therefore on most platforms. It consists of Mathematica routines for representing, manipulating, displaying and transforming graphs, as well as routines implementing some relation algebra-theoretic operation...
متن کاملRefactoring Heterogeneous Relation Algebras around Ordered Categories and Converse
We present a reorganisation of popular theories of “reasoning with relational flavour”, including allegories, Kleene algebras, and Dedekind categories, into an relatively symmetric picture using ordered categories as common base and defining converse independently from joins and meets. As an example application, we use this to regroup results about formalisation of algebraic graph rewriting and...
متن کاملSymbolic Maximum Likelihood Estimation with Mathematica
Mathematica is a symbolic programming language that empowers the user to undertake complicated algebraic tasks. One such task is the derivation of maximum likelihood estimators, demonstrably an important topic in statistics at both the research and the expository level. In this paper, a Mathematica package is provided that contains a function entitled SuperLog. This function utilizes pattern-ma...
متن کامل